Convex polyhedral meshing for robust solid modeling

We introduce a new technique to create mesh of convex polyhedra representing the interior volume triangulated input surface. Our approach is particularly tolerant defects in input, which allowed self-intersect, be non-manifold, disconnected, and contain surface holes gaps. guarantee that exactly represented as union polygonal facets output mesh. Thanks our algorithm, traditionally difficult solid modeling operations such booleans Minkowski sums become surprisingly robust easy implement, even if has defects. leverages on recent concept indirect geometric predicate provide an unprecedented combination guaranteed robustness speed, thus enabling practical implementation though flexible systems. have extensively tested method all 10000 models Thingi10k dataset, concluded no existing provides comparable robustness, precision performances.